Chris Pollett >Old Classes >
CS154
( Print View )

Student Corner:
  [Grades Sec3]
  [Grades Sec5]

  [Submit Sec3]
  [Submit Sec5]

  [Email List Sec3]
  [Email List Sec5]

  [Lecture Notes]

Course Info:
  [Texts & Links]
  [Topics]
  [Grading]
  [HW Info]
  [Exam Info]
  [Regrades]
  [Honesty]
  [Additional Policies]
  [Announcements]

HW Assignments:
  [Hw1]  [Hw2]  [Hw3]
  [Hw4]  [Hw5]

Practice Exams:
  [Mid1]  [Mid2]  [Final] 

                           












HW#3 --- last modified March 02 2019 21:28:59..

Solution set.

Due date: Mar 20

Files to be submitted:
  Hw3.tex

Purpose: To be able to write simple context-free grammars and PDAs, to know the difference between ambigous and unambiguous grammars, to know how to tell if a language is not context free, to to simulate a Turing machine's computation.

Specification:

Do problems 2.4, 2.10, 2.14, 2.27, 2.30, 3.2 out of Sipser and write up your solution in LaTeX as Hw3.tex.

Point Breakdown

LaTeX file compiles 1pt
Problems from the book (1.5pts each) 9pts
Total10pts